Search results for " Topology"
showing 10 items of 1371 documents
El “giro morfológico”: la forma, condición del sentido
2006
This paper starts from the philosophical contradiction that we can call 'apory of logical fundament'. Logic appears, on the one side, as having the metaphysical pretensions of universality and wholeness and, on the other side, as having local efficiency in computers' concrete world. Several alternatives have tried to go over this apory, from alogical philosophies to logic amplifying attempts. René Thom's ontology changes the terms of the question and, instead of looking for the fundament in logic, he does so in topology. His slogan is: 'We have to found, not geometry in logic, but logic in geometry'. The fundamental ontological implication of this morphologic change is to find the sense con…
New bronchodilators selected by molecular topology.
1998
Molecular topology has been applied to find new lead compounds with bronchodilator activity. Among the selected compounds stands out 3-(1H-tetrazol-5yl)-9H-thioxanthene-9 -one-10,10-dioxide, anthrarobin, 9-oxo-9H-thioxantene-3-carboxylic-10,10-dioxide acid, acenocoumarol and griseofulvin, with a percentage of relaxation, at 0.1 mM, of 91, 92, 85, 69, and 74%, respectively. Theophylline shows a correspondent value of 77% (Emax = 100% at 1 mM).
Three-page encoding and complexity theory for spatial graphs
2004
We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of graphs into the product of the line with the cone on three points. By exploiting three-page embeddings we introduce the notion of the three-page complexity for spatial graphs. This complexity satisfies the properties of finiteness and additivity under natural operations.
Two-view “cylindrical decomposition” of binary images
2001
This paper describes the discrete cylindrical algebraic decomposition (DCAD) construction along two orthogonal views of binary images. The combination of two information is used to avoid ambiguities for image recognition purposes. This algorithm associates an object connectivity graph to each connected component, allowing a complete description of the structuring information. Moreover, an easy and compact representation of the scene is achieved by using strings in a five letter alphabet. Examples on complex digital images are also provided. © 2001 Elsevier Science Inc.
Wi-Dia: Data-Driven Wireless Diagnostic Using Context Recognition
2018
The recent densification of Wi-Fi networks is exacerbating the effects of well-known pathologies including hidden nodes and flow starvation. This paper provides an automatic diagnostic tool for detecting the source roots of performance impairments by recognizing the wireless operating context. Our tool for Wi-Fi diagnostic, named Wi-Dia, exploits machine learning methods and uses features related to network topology and channel utilization, without impact on regular network operations and working in real-time. Real-time per-link Wi-Fi diagnosis enables recovering actions for context-specific treatments. Wi-Dia classifier recognizes different classes of interference; it is jointly trained us…
A class of nilpotent Lie algebras admitting a compact subgroup of automorphisms
2017
Abstract The realification of the ( 2 n + 1 ) -dimensional complex Heisenberg Lie algebra is a ( 4 n + 2 ) -dimensional real nilpotent Lie algebra with a 2-dimensional commutator ideal coinciding with the centre, and admitting the compact algebra sp ( n ) of derivations. We investigate, in general, whether a real nilpotent Lie algebra with 2-dimensional commutator ideal coinciding with the centre admits a compact Lie algebra of derivations. This also gives us the occasion to revisit a series of classic results, with the expressed aim of attracting the interest of a broader audience.
Block Based Deconvolution Algorithm Using Spline Wavelet Packets
2010
This paper presents robust algorithms to deconvolve discrete noised signals and images. The idea behind the algorithms is to solve the convolution equation separately in different frequency bands. This is achieved by using spline wavelet packets. The solutions are derived as linear combinations of the wavelet packets that minimize some parameterized quadratic functionals. Parameters choice, which is performed automatically, determines the trade-off between the solution regularity and the initial data approximation. This technique, which id called Spline Harmonic Analysis, provides a unified computational scheme for the design of orthonormal spline wavelet packets, fast implementation of the…
Pearl-necklace structures of molecular brushes with rigid backbone under poor solvent conditions: A simulation study
2010
Bottle-brush polymers, where flexible side chains containing N=20 to 50 effective monomers are grafted to a rigid backbone, are studied by molecular dynamics simulations, varying the grafting density σ and the solvent quality. Whereas for poor solvents and large enough σ the molecular brush is a cylindrical object, homogeneous in axial direction, for intermediate values of σ an axially inhomogeneous structure of "pearl-necklace" type is formed. The "pearls," however, have a strongly nonspherical ellipsoidal shape, due to the fact that several side chains cluster together in one pearl, qualitatively consistent with predictions of Sheiko et al. [Eur. Phys. J. E 13, 125 (2004)] We analyze the …
A note on rank 2 diagonals
2020
<p>We solve two questions regarding spaces with a (G<sub>δ</sub>)-diagonal of rank 2. One is a question of Basile, Bella and Ridderbos about weakly Lindelöf spaces with a G<sub>δ</sub>-diagonal of rank 2 and the other is a question of Arhangel’skii and Bella asking whether every space with a diagonal of rank 2 and cellularity continuum has cardinality at most continuum.</p>
Rates of convergence to equilibrium for collisionless kinetic equations in slab geometry
2017
This work deals with free transport equations with partly diffuse stochastic boundary operators in slab geometry. Such equations are governed by stochastic semigroups in $L^{1}$ spaces$.\ $We prove convergence to equilibrium at the rate $O\left( t^{-\frac{k}{2(k+1)+1}}\right) \ (t\rightarrow +\infty )$ for $L^{1}$ initial data $g$ in a suitable subspace of the domain of the generator $T$ where $k\in \mathbb{N}$ depends on the properties of the boundary operators near the tangential velocities to the slab. This result is derived from a quantified version of Ingham's tauberian theorem by showing that $F_{g}(s):=\lim_{\varepsilon \rightarrow 0_{+}}\left( is+\varepsilon -T\right) ^{-1}g$ exists…